Constraint Handling Rules

نویسنده

Thom W. Frühwirth

چکیده

Constraint Handling Rules (CHR) is both a theoretical formalism based on logic and a practical programming language based on rules. This book, written by the creator of CHR, describes the theory of CHR and how to use it in practice. It is supported by a website containing teaching materials, online demos, and free downloads of the language. After a basic tutorial, the author describes in detail the CHR language, beginning with its syntax and semantics. Guaranteed properties of CHR programs such as concurrency and analysis for desirable properties such as termination are discussed next. The author then compares CHR with other formalisms and languages and illustrates how it can capture their essential features. In the last part, some larger programs are introduced and analyzed in detail. The book is ideal for graduate students and lecturers, and for more experienced programmers and researchers, who can use it for self-study. Exercises with selected solutions, and bibliographic remarks are included at the ends of chapters. The book is the definitive reference on the subject.

متن کامل

منابع مشابه

Programming in Constraint Handling Rules

Constraint Handling Rules (CHR) is a concurrent committedchoice constraint programming language, developed in the 1990s for the implementation of constraint solvers. It is traditionally an extension to other programming languages – especially constraint logic programming languages – but has been used increasingly as a general-purpose programming language in the recent past. With CHR, one can sp...

متن کامل

Welcome to Constraint Handling Rules

Constraint Handling Rules (CHR) is a declarative concurrent committed-choice constraint logic programming language consisting of guarded rules that transform multisets of relations called constraints until no more change occurs. As an introduction to CHR as a generalpurpose programming language we present some small programs using different programming styles and discuss their properties.

متن کامل

Satisfiability Modulo Constraint Handling Rules (Extended Abstract)

Satisfiability Modulo Constraint Handling Rules (SMCHR) is the integration of the Constraint Handling Rules (CHRs) solver programming language into a Satisfiability Modulo Theories (SMT) solver framework. Constraint solvers are implemented in CHR as a set of high-level rules that specify the simplification (rewriting) and constraint propagation behavior. The traditional CHR execution algorithm ...

متن کامل

On Connuence of Constraint Handling Rules on Connuence of Constraint Handling Rules

We introduce the notion of connuence for Constraint Handling Rules (CHR), a powerful language for writing constraint solvers. With CHR one simpliies and solves constraints by applying rules. Connuence guarantees that a CHR program will always compute the same result for a given set of constraints independent of which rules are applied. We give a decidable, suucient and necessary syntactic condi...

متن کامل

Proceedings of CHR 2005, Second Workshop on Constraint Handling Rules

This book contains the Proceedings of CHR 2005, the Second Workshop on Constraint Handling Rules, held at the occasion of ICLP 2005 in Sitges (Spain) on October 5, 2005. The Constraint Handling Rules (CHR) language has become a major declarative specification and implementation language for constraint reasoning algorithms and applications. Algorithms are often specified using inference rules, r...

متن کامل